Computing geodesic paths on manifolds.
نویسندگان
چکیده
The Fast Marching Method is a numerical algorithm for solving the Eikonal equation on a rectangular orthogonal mesh in O(M log M) steps, where M is the total number of grid points. In this paper we extend the Fast Marching Method to triangulated domains with the same computational complexity. As an application, we provide an optimal time algorithm for computing the geodesic distances and thereby extracting shortest paths on triangulated manifolds.
منابع مشابه
A Geometry Preserving Kernel over Riemannian Manifolds
Abstract- Kernel trick and projection to tangent spaces are two choices for linearizing the data points lying on Riemannian manifolds. These approaches are used to provide the prerequisites for applying standard machine learning methods on Riemannian manifolds. Classical kernels implicitly project data to high dimensional feature space without considering the intrinsic geometry of data points. ...
متن کاملRicci tensor for $GCR$-lightlike submanifolds of indefinite Kaehler manifolds
We obtain the expression of Ricci tensor for a $GCR$-lightlikesubmanifold of indefinite complex space form and discuss itsproperties on a totally geodesic $GCR$-lightlike submanifold of anindefinite complex space form. Moreover, we have proved that everyproper totally umbilical $GCR$-lightlike submanifold of anindefinite Kaehler manifold is a totally geodesic $GCR$-lightlikesubmanifold.
متن کاملENTROPY OF GEODESIC FLOWS ON SUBSPACES OF HECKE SURFACE WITH ARITHMETIC CODE
There are dierent ways to code the geodesic flows on surfaces with negative curvature. Such code spaces give a useful tool to verify the dynamical properties of geodesic flows. Here we consider special subspaces of geodesic flows on Hecke surface whose arithmetic codings varies on a set with innite alphabet. Then we will compare the topological complexity of them by computing their topological ...
متن کاملA survey of geodesic paths on 3D surfaces
Finding shortest paths and shortest distances between points on a surface S in three-dimensional space is a well-studied problem in differential geometry and computational geometry. The shortest path between two points on S is denoted a geodesic path on the surface and the shortest distance between two points on S is denoted a geodesic distance. In this survey, we consider the case where a disc...
متن کاملComputing geodesic paths on triangulated manifolds
Solving the Eikonal equation on a surface allows establishment of a curvilinear coordinate system which facilitates many types of physics-based simulations and measurements. Existing methods that solve the Eikonal equation on surface triangulations suffer from significant limitations prohibiting their use in many applications. First, the surface may not have any holes. Second, every obtuse tria...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Proceedings of the National Academy of Sciences of the United States of America
دوره 95 15 شماره
صفحات -
تاریخ انتشار 1998